273 research outputs found

    From incommensurate correlations to mesoscopic spin resonance in YbRh2Si2

    Full text link
    Spin fluctuations are reported near the magnetic field driven quantum critical point in YbRh2Si2. On cooling, ferromagnetic fluctuations evolve into incommensurate correlations located at q0=+/- (delta,delta) with delta=0.14 +/- 0.04 r.l.u. At low temperatures, an in plane magnetic field induces a sharp intra doublet resonant excitation at an energy E0=g muB mu0 H with g=3.8 +/- 0.2. The intensity is localized at the zone center indicating precession of spin density extending xi=6 +/- 2 A beyond the 4f site.Comment: (main text - 4 pages, 4 figures; supplementary information - 3 pages, 3 figures; to be published in Physical Review Letters

    Stochastic differential equations for evolutionary dynamics with demographic noise and mutations

    Get PDF
    We present a general framework to describe the evolutionary dynamics of an arbitrary number of types in finite populations based on stochastic differential equations (SDE). For large, but finite populations this allows to include demographic noise without requiring explicit simulations. Instead, the population size only rescales the amplitude of the noise. Moreover, this framework admits the inclusion of mutations between different types, provided that mutation rates, μ\mu, are not too small compared to the inverse population size 1/N. This ensures that all types are almost always represented in the population and that the occasional extinction of one type does not result in an extended absence of that type. For μN≪1\mu N\ll1 this limits the use of SDE's, but in this case there are well established alternative approximations based on time scale separation. We illustrate our approach by a Rock-Scissors-Paper game with mutations, where we demonstrate excellent agreement with simulation based results for sufficiently large populations. In the absence of mutations the excellent agreement extends to small population sizes.Comment: 8 pages, 2 figures, accepted for publication in Physical Review

    Single polaron properties of the breathing-mode Hamiltonian

    Full text link
    We investigate numerically various properties of the one-dimensional (1D) breathing-mode polaron. We use an extension of a variational scheme to compute the energies and wave-functions of the two lowest-energy eigenstates for any momentum, as well as a scheme to compute directly the polaron Greens function. We contrast these results with results for the 1D Holstein polaron. In particular, we find that the crossover from a large to a small polaron is significantly sharper. Unlike for the Holstein model, at moderate and large couplings the breathing-mode polaron dispersion has non-monotonic dependence on the polaron momentum k. Neither of these aspects is revealed by a previous study based on the self-consistent Born approximation

    Quantum Circulant Preconditioner for Linear System of Equations

    Get PDF
    We consider the quantum linear solver for Ax=bAx=b with the circulant preconditioner CC. The main technique is the singular value estimation (SVE) introduced in [I. Kerenidis and A. Prakash, Quantum recommendation system, in ITCS 2017]. However, some modifications of SVE should be made to solve the preconditioned linear system C−1Ax=C−1bC^{-1} Ax = C^{-1} b. Moreover, different from the preconditioned linear system considered in [B. D. Clader, B. C. Jacobs, C. R. Sprouse, Preconditioned quantum linear system algorithm, Phys. Rev. Lett., 2013], the circulant preconditioner is easy to construct and can be directly applied to general dense non-Hermitian cases. The time complexity depends on the condition numbers of CC and C−1AC^{-1} A, as well as the Frobenius norm ∥A∥F\|A\|_F

    Dynamic Computation of Network Statistics via Updating Schema

    Full text link
    In this paper we derive an updating scheme for calculating some important network statistics such as degree, clustering coefficient, etc., aiming at reduce the amount of computation needed to track the evolving behavior of large networks; and more importantly, to provide efficient methods for potential use of modeling the evolution of networks. Using the updating scheme, the network statistics can be computed and updated easily and much faster than re-calculating each time for large evolving networks. The update formula can also be used to determine which edge/node will lead to the extremal change of network statistics, providing a way of predicting or designing evolution rule of networks.Comment: 17 pages, 6 figure

    Eigenvalue Estimation of Differential Operators

    Full text link
    We demonstrate how linear differential operators could be emulated by a quantum processor, should one ever be built, using the Abrams-Lloyd algorithm. Given a linear differential operator of order 2S, acting on functions psi(x_1,x_2,...,x_D) with D arguments, the computational cost required to estimate a low order eigenvalue to accuracy Theta(1/N^2) is Theta((2(S+1)(1+1/nu)+D)log N) qubits and O(N^{2(S+1)(1+1/nu)} (D log N)^c) gate operations, where N is the number of points to which each argument is discretized, nu and c are implementation dependent constants of O(1). Optimal classical methods require Theta(N^D) bits and Omega(N^D) gate operations to perform the same eigenvalue estimation. The Abrams-Lloyd algorithm thereby leads to exponential reduction in memory and polynomial reduction in gate operations, provided the domain has sufficiently large dimension D > 2(S+1)(1+1/nu). In the case of Schrodinger's equation, ground state energy estimation of two or more particles can in principle be performed with fewer quantum mechanical gates than classical gates.Comment: significant content revisions: more algorithm details and brief analysis of convergenc

    The bends on a quantum waveguide and cross-products of Bessel functions

    Full text link
    A detailed analysis of the wave-mode structure in a bend and its incorporation into a stable algorithm for calculation of the scattering matrix of the bend is presented. The calculations are based on the modal approach. The stability and precision of the algorithm is numerically and analytically analysed. The algorithm enables precise numerical calculations of scattering across the bend. The reflection is a purely quantum phenomenon and is discussed in more detail over a larger energy interval. The behaviour of the reflection is explained partially by a one-dimensional scattering model and heuristic calculations of the scattering matrix for narrow bends. In the same spirit we explain the numerical results for the Wigner-Smith delay time in the bend.Comment: 34 pages, 21 figure
    • …
    corecore